Scheduling in Green Vehicular Infrastructure with Multiple Roadside Units Amir Khezrian, Abdulla Hammad and Terence D. Todd George Karakostas

Source URL: www.cas.mcmaster.ca

• Wireless networking
• Network flow
• Operations research
• Vehicular ad hoc network
• Minimum-cost flow problem
• Wireless ad hoc network
• Intelligent transportation system
• Maximum flow problem
• Integer programming

1 Convexification of Generalized Network Flow Problem with Application to Power Systems Somayeh Sojoudi∗ and Javad Lavaei+ ∗

Source URL: www.ieor.berkeley.edu

Noname manuscript No. (will be inserted by the editor) Convexification of Generalized Network Flow Problem Somayeh Sojoudi · Salar Fattahi · Javad

Source URL: www.ieor.berkeley.edu

Microsoft Word - 050Vitins_full_paper.doc

Source URL: www.strc.ch

• Operations research
• Cybernetics
• Network theory
• Genetic algorithm
• Ant colony optimization algorithms
• Travelling salesman problem
• Shortest path problem
• Flow network

Static Traffic Assignment Problem. A comparison between Beckmannand Nesterov & de Palmamodels. Fabian A. Chudak, D-Wave Systems Vania Dos Santos Eleuterio, IFOR ETH Zurich

Source URL: www.strc.ch

• Transport
• Mathematical optimization
• Mathematics
• Business
• Network flow
• Operations research
• Game theory
• Road traffic management
• Route assignment
• John Glen Wardrop
• Flow network
• Convex optimization

Convex Analysis of Generalized Flow Networks Salar Fattahi and Javad Lavaei Department of Electrical Engineering, Columbia University Abstract— This paper is concerned with the generalized network flow (GNF) problem, w

Source URL: www.ieor.berkeley.edu

Traffic demand pattern generation for a grid network based on experiment design Qiao Ge, ETH Zurich Javier Ortigosa, ETH Zurich Monica Menendez, ETH Zurich

Source URL: www.strc.ch

• Transport
• Land transport
• Road transport
• Road traffic management
• Transportation planning
• Network flow
• Route assignment
• Traffic congestion
• Traffic simulation
• Traffic
• Maximum flow problem

1 Convexification of Power Flow Problem over Arbitrary Networks Ramtin Madani, Javad Lavaei and Ross Baldick Abstract—Consider an arbitrary power network with PV and

Source URL: www.ieor.berkeley.edu

PDF Document

Source URL: www.cs.ucsb.edu

• Network theory
• Routing algorithms
• Edsger W. Dijkstra
• Graph theory
• Shortest path problem
• Distance oracle
• Routing
• Flow network
• Contraction hierarchies
• K shortest path routing

Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma∗ , Jiang Chen∗ , Yang Richard Yang∗ and Arvind Krishnamurthy† ∗ Department of Computer Science

Source URL: www-net.cs.yale.edu

• Graph theory
• Network flow
• Distributed computing architecture
• Network architecture
• Overlay network
• Peer-to-peer
• Maximum flow problem
• Network congestion
• Shortest path problem
• Mathematics
• Operations research
• Applied mathematics